On a combinatorial problem associated with the odd order theorem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Machine-Checked Proof of the Odd Order Theorem

This paper reports on a six-year collaborative effort that culminated in a complete formalization of a proof of the Feit-Thompson Odd Order Theorem in the Coq proof assistant. The formalized proof is constructive, and relies on nothing but the axioms and rules of the foundational framework implemented by Coq. To support the formalization, we developed a comprehensive set of reusable libraries o...

متن کامل

A combinatorial problem associated with nonograms

Associated with an m × n matrix with entries 0 or 1 are the m-vector of row sums and n-vector of column sums. In this article we study the set of all pairs of these row and column sums for fixed m and n. In particular, we give an algorithm for finding all such pairs for a given m and n. © 2005 Elsevier Inc. All rights reserved.

متن کامل

A Uniqueness Theorem for the Generalized-Order Linear Complementary Problem Associated With M-Matrices

In this paper, we prove a uniqueness theorem for a.elass of eomplementari~ problems involving M-matrices.

متن کامل

On a Combinatorial Problem

Let M be a set and F a family of its subsets. F is said by E. W. MILLER [5] to possess property B if there exists a subset K of M so that no set of the family F is contained either in K or in K (K is the complement of K in M) . HAJNAL and 1 [2] recently published a paper on the property B and its generalisations . One of the unsolved problems we state asks : What is the smallest integer in (n) ...

متن کامل

The Inverse Galois Problem for Nilpotent Groups of Odd Order

Consider any nilpotent group G of finite odd order. We ask if we can always find a galois extension K of Q such that Gal(K/Q) ∼= G. This is the famous Inverse Galois Problem applied to nilpotent groups of finite odd order. By solving the Group Extension Problem and the Embedding Problem, two problems that are related to the Inverse Galois Problem, we show that such a K always exists. A major re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1993

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-1993-1160299-x